Garbage collection for data storage

ABSTRACT

Methods, systems, apparatus, including computer programs encoded on computer storage media, for reclaiming storage space in a storage environment. In one aspect, the method includes actions of aggregating data that is indicative of access to one or more data objects, determining a future storage cost associated with each of a plurality of data objects, determining an access window for each of the plurality of data objects, identifying a data object based on (i) the future storage cost that satisfies a predetermined threshold and (ii) a data object access window, providing a notification to a user device that requests feedback from a user indicating whether the data object can be deleted, and in response to receiving data that indicates that the data object can be deleted, generating an instruction to cause deletion of the data object upon the expiration of the access window.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. application Ser. No.16/194,115, filed Nov. 16, 2018, which application is a continuation ofU.S. application Ser. No. 15/614,871, now U.S. Pat. No. 10,133,658,filed Jun. 6, 2017, which claims priority to Greek Application No.20170100197, filed May 2, 2017. The disclosure of each of the foregoingapplications is incorporated herein by reference.

BACKGROUND

Garbage collection of data objects in storage poses significantchallenges, especially as the scale (e.g., terabyte, petabyte, exabyte,or more) of data maintained in storage increases. Challenges are alsointroduced due to the complexity of the data structures (e.g., cancontain millions of columns of more), and often limited knowledge aboutconsumers and intended use of the data.

SUMMARY

According to one innovative aspect of the present disclosure, acomputer-implemented method of reclaiming storage space in a big datastorage environment is disclosed. The method may include actions ofaggregating, by one or more server computers, data that is descriptiveof access to data objects stored in a storage environment, determining,by the one or more server computers, a future storage cost associatedwith each data object of a plurality of data objects in the storageenvironment, determining, by the one or more server computers, an accesswindow for each data object of the plurality of data objects in thestorage environment, each access window having a respective expirationdate in the future, identifying, by the one or more server computers,one or more first data objects, each of the first data objects being adata object for which the determined future storage cost satisfies apredetermined future storage cost threshold, for each identified firstdata object: providing, by the one or more server computers, anotification to user device that requests feedback from a userindicating whether the data object can be deleted after expiration ofthe access window, receiving, by the one or more server computers, dataindicative of whether the data object can be deleted after expiration ofthe access window from the user device; and in response to receivingdata that indicates that the data object can be deleted after expirationof the access window from the user device, generating an instruction tocause deletion of the data object upon the expiration of the accesswindow.

Other aspects include corresponding systems, apparatus, and computerprograms to perform the actions of methods defined by instructionsencoded on computer storage devices.

These and other version may optionally include one or more of thefollowing features. For instance, in some implementations, the methodmay further include in response to receiving data that indicates thatthe data object can be deleted after expiration of the access windowfrom the user device, generating an instruction that instructs thestorage environment to label the data object for deletion upon theexpiration of the access window.

In some implementations, the method may further include in response toreceiving data that indicates that the data object cannot be deletedafter expiration of the access window from the user device, adjustingheuristics used to determine the access window.

In some implementations, aggregating, by the one or more servercomputers, data that is descriptive of access to the data objects storedin the storage environment may include: obtaining, by the one or moreserver computers, audit log data records from one or more audit logsmaintained by the storage environment, wherein each audit log datarecord includes data that (i) identifies a data object that was accessedand (ii) a timestamp indicating when the access to the data objectoccurred, and storing, by the one or more server computers, the obtainedaudit log data records in a database.

In some implementations, determining, by the one or more servercomputers, an access window for each data object of the plurality ofdata objects in the storage environment may include analyzing, by theone or more server computers, the audit log data in the database todetermine a period of time where the data object is likely to beaccessed.

In some implementations, determining, by the one or more servercomputers, a future storage cost associated with each data object of theplurality of data objects in the storage environment may include: usingone or more heuristics to estimate the potential future storage costs ofthe data object based on the predicted future depreciation of storageprices.

In some implementations, the method may also include sorting, by the oneor more server computers, the one or more first data objects based on(i) the future storage cost that can be reclaimed for each respectivedata object, and (ii) a confidence score indicating whether or not eachrespective data object will be accessed outside of the access window.

In some implementations, the label may include a timestamp indicating atime when the access window of the data object expires.

The subject matter of the present disclosure provides multipleadvantages over conventional methods. For example, features of thepresent disclosure optimize storage reclamation processes in a “bigdata” storage environment. In some implementations, for example, thepresent disclosure can make determinations regarding whether or not toreclaim storage space in a “big data” storage system based on acomparison of an estimated future storage cost of a data object to acost of reclaiming storage space associated with the data object fromthe “big data” storage system. Such a cost-benefit analysis is unique toa “big data” storage system because the size of data objects may beextremely large. This optimizes a storage reclamation process byprogramming the process to determine that, in certain instances (e.g.,where the cost to reclaim storage is greater than the estimated futurestorage cost), that it is more efficient to leave a data object storedin “big data” storage than to go through the necessary steps to reclaimthe data—even when no user is expected to access the data object in thefuture. In some instances, therefore, it may be more efficient to leavea data object in “big data” storage as opposed to reclaiming the storagespace associated with the “big data” object because, for example, themonetary cost of storage depreciates over time.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a contextual diagram of a system for reclaiming storage spacein a storage environment.

FIG. 2 is a flowchart of a process for reclaiming storage space in astorage environment.

DETAILED DESCRIPTION

The present disclosure is directed towards a system and method thatoptimizes the use of storage resources in a storage environment relativeto conventional storage systems that do not use the systems and methodsdescribed in this specification. In the example description thatfollows, the storage system is often referred to as a “big data” storagesystem, as the benefits and advantages realized increase in proportionto the scale of the amount of data stored in the storage system.However, the features described below can be used in any storage system,and thus are not limited to storage systems that may be classified as“big data” storage systems.

The system and method described by the present disclosure can optimizethe use of storage resources in a storage environment by reclaimingstorage space occupied by data objects in the storage environment thatthe system determines are no longer useful. A data object may beidentified as a candidate for reclamation based on (i) a determinationthat the data object is likely to incur more than a threshold amount offuture storage cost if kept in storage, and (ii) a determination that apredetermined access window associated with the data object has expired.A data object may exceed the threshold amount of storage cost if anestimated future storage cost is determined to be greater than the costto remove the data object in the present. In some instances, the systemand methods described by the present disclosure may also be used toreclaim storage space used to maintain an entire repository of dataobjects.

FIG. 1 is a contextual diagram of a system 100 for reclaiming storagespace in a storage environment. The system 100 includes a user device110, a network 115, a server 130, and a storage environment 145. Forpurposes of illustration only, the storage environment 145 is referredto as a big data storage environment 145.

The big data storage environment 145 includes one or more servercomputers 145-1 to 145-n that provide physical storage of data objects,wherein n is any positive integer. In some implementations, the big datastorage environment 145 may be operated by a single entity and used toprovide physical storage for multiple data object repositories 150, 151,512, 153, 154, 155 that store data objects that are obtained, generated,maintained, or a combination thereof, by the single entity.Alternatively, the big data storage environment 145 may be a cloud-basedsystem that provides physical storage for m entities, where m is anypositive integer. In such a cloud-based system, the big data storageenvironment 145 may allocate storage space 147-1 to a first entity foruse in storing the first entity's data object repositories 150, 151,152, 153, 154, 155 and a different storage space 147-m to a secondentity for use in storing the second entity's data object repositories160, 161, 162, 163, 164, 165.

An entity may include any person, group of persons, organization (e.g.,a corporation, government agency, or the like), computer system (e.g.,artificial intelligence agents), or the like that needs storage space tostore data. By way of example, an entity such as an internationalretailer (hereafter “retailer”) may require storage space to store bigdata. This example is depicted in FIG. 1 with reference to the storagespace 147-m. At stage A, a retailer may use the storage space 147-m tostore multiple diverse types of data object repositories such as arepository of customer surveys 160, a repository of documents 161,relational database repository 162 storing sales data, a column databaserepository 163 storing inventory data, a repository of social mediaposts 164, and a repository of purchase location information 165. One ormore agents, employees, or the like of the retailer may use one or moresoftware tools provided by the big data storage environment to performdata analytic operations on the big data maintained by the data objectrepositories stored in storage space 147-m. For example, one or moredata analytic algorithms may be employed to analyze the retailer's bigdata such as sales data, inventory data, customer purchase locationinformation, and social media posts to identify or predict sales trendsin one or more particular geographic regions. Alternatively, or inaddition, such data analytic algorithms may be automated to run atpredetermined time intervals, in response to particular events, or thelike.

The big data storage environment 145 may maintain an audit log 160A,161A, 162A, 163A, 164A, 165A for each respective data object repositorysuch as data object repositories 160, 161, 162, 163, 164, 165 that arestored in the big data storage environment 145. Each respective auditlog 160A, 161A, 162A, 163A, 164A, 165A may include a history of accessesto respective data objects in each respective data object repositorywith which the respective audit log 160A, 161A, 162A, 163A, 164A, 165Ais associated. The history of accesses maintained by each respectiveaudit log may include multiple data records that are generated by thebig data storage environment 145 in response to each access of a dataobject. Each data record may include, for example, the data object thatwas accessed, type of access (e.g., read access, write access, or thelike), and a timestamp. The time stamp may include the time of theaccess and the date of the access. In some implementations, eachrespective audit log 160A, 161A, 162A, 163A, 164A, 165A may maintain thedata records representing access to the respective data objects inchronological order. The history of accesses maintained by the audit log160A, 161A, 162A, 163A, 164A, 165A may be a complete history of accessesto respective data objects or an incomplete history of accesses torespective data objects.

Though the example of FIG. 1 shows multiple different audit logs thatare each associated with a particular data object repository, thepresent disclosure need not be so limited. For example, each storagespace 147-1 to 147-m may have a single audit log that generates andstores audit log data records describing each access to a data object inthe storage space. Alternatively, the big data storage environment 145may include a single audit log that generates and stores data recordsdescribing each access to each data object in the big data storageenvironment 145. Other configurations of audit logs are also consideredto fall within the scope of the present disclosure.

Over time, the big data storage environment 145 may accumulate vastamounts of data on the order of many terabytes, petabytes, exabytes, oreven more. However, it is likely that less than all of the datamaintained by the big data storage environment 145 is useful to anentity that is using the big data storage environment 145 to store theentity's big data. In some implementations, usefulness of datamaintained by the big data storage environment 145 may be based onwhether the data will be useful in the future (e.g., whether data isuseful after a predetermined number of days).

The server 130 can be used to reclaim storage space occupied by one ormore data objects stored in the big data storage environment 145. Theserver 130 includes an accesses database 132, a heuristic unit 133, afuture storage cost analysis unit 133 a, an access window determinationunit 133 b, and a storage reclamation unit 136. In this specification,the term “unit” will be used broadly to refer to a software or hardwarebased system or subsystem that can perform one or more specificfunctions. Generally, a unit will be implemented as one or more softwaremodules or components, installed on one or more computers in one or morelocations; in other cases, multiple units can be installed on the samecomputer or computers.

The server 130 aggregates data records from each of the audit logsmaintained by the big data storage environment 145. For example, theserver can transmit a request 120 for audit log data records via thenetwork 115 that is received 121 by the big data storage environment145. In response to the request, the big data storage environment 145may return 122 to the server 130 via the network 115 audit log datarecords maintained by each audit log 150A, 151A, 152A, 153A, 154A, 155A,160A, 161A, 162A, 163A, 164A, 165A for each storage space 147-1 to 147-mof the big data storage environment 145. The server 130 may receive 123the audit log data records and store 131 the received audit log datarecords in the accesses database 132. The aggregated data records fromeach of the audit logs can be used by the server 130 to determine anaccess window for one or more data objects stored by the big datastorage environment 145. The network 115 may include, for example, oneor more of a LAN, a WAN, a cellular network, the Internet, or acombination thereof.

The server 130 may transmit multiple requests such as request 120 overtime in an effort to keep the accesses database 132 updated. Forexample, the server 130 may be configured to periodically request datarecords from audit logs at predetermined intervals (e.g., hourly, daily,nightly, weekly, or the like.). Alternatively, or in addition, theserver 130 may be configured to request data records from audit logs ondemand (e.g., in response to a user instruction). Alternatively, or inaddition the server 130 may be configured to obtain the data recordsfrom audit logs associated with one or more data objects prior to makinga recommendation to a user of user device 110 to reclaim storage spacestoring the one or more data objects.

The server 130 includes a heuristic unit 133 that can be used toidentify data objects that are candidates for storage reclamation. Insome implementations, identifying data objects that are candidates forstorage reclamation includes a two-part process of first using a futurestorage cost unit 133 a to identify a first set of one or more dataobjects stored in the big data storage environment 145 having a futurestorage cost that satisfies a predetermined future storage costthreshold, and then determining an access window for each of the one ormore data objects in the first set of data objects. Alternatively, insome implementations, the server 130 may receive data identifying asecond set of one or more data objects that were previously determinedto have a future storage cost that satisfies a predetermined futurestorage cost threshold, and then the server can determine an accesswindow for each of the one or more data objects in the second set ofdata. Accordingly, in some implementations, it may not be necessary forthe server 130 to determine a predicted future storage cost. Dataidentifying each data object of the first set of one or more dataobjects is provided 135 by the heuristic unit 133 to the storagereclamation unit 136.

The future storage cost unit 133 a is configured to identify one or moredata objects stored in the big data storage environment 145 that may becandidates for storage reclamation. A data object may be a candidate forstorage reclamation if the future storage cost unit 133 a predicts thatthe data object is associated with a future storage cost that satisfiesa predetermined future storage cost threshold. The future storage costunit 133 a may determine the future storage cost for one or more dataobjects stored in the big data storage environment 145 based on the useof a series of heuristics that analyze one or more of a number ofdifferent factors. The factors may include, for example, the footprintof the data object, replication of the data object, retention ofdatasets containing the data objects, overall depreciation of storageprice, feedback from entities responsible for oversight of the dataobjects (e.g., one or more agents, employees, computer systems (e.g.,artificial intelligence agents), or the like from an entity using thebig data storage environment to store the entity's big data), acombination thereof, or the like.

In some implementations, predicting a future storage cost for one ormore data objects may include accessing 134 and analyzing audit log datarecords stored in the accesses database 132. The future storage costunit 133 a may predict a future storage cost for a respective dataobject based on trends detected in the historical accesses logged forthe data object. In some instances, a higher future storage cost may bepredicted for a data object (i) if, e.g., the aggregated audit logsindicate that the footprint for the data object is increasing, (ii) if,e.g., the data object is routinely replicated, (iii) if, e.g., data setscontaining the data object are retained for indefinite periods of time,(iv) a combination thereof, (v) or the like.

In some instances, heuristics employed by the future storage cost unit133 a can predict a future storage cost by considering factors otherthan just the amount of storage space that a data object requires. Forexample, the future storage cost unit 133 a may predict the futurestorage cost for a data object based on (i) the amount of storage spacethat a data object is predicted to require and (ii) an estimateddepreciation in the price of storage space. Determining a predictedfuture storage cost for a data object as a function of both (i) futurestorage space required for data object and (ii) the depreciation inprice of storage space provides a more accurate storage cost estimate ina big data storage environment 145 where storage is vast and additionalstorage can be readily added.

The future estimated storage cost for a data object may be expressed interms of the amount of storage space that is required to maintain thedata object. For example, the future estimated storage cost may beexpressed using a unit of storage (e.g., the cost to maintain aparticular data object may be a number of gigabytes (GB), terabytes(TB), petabytes (PB), exabytes (EB), or the like). Alternatively, thefuture estimated storage cost for a data object may be expressed interms of an estimated amount of money (e.g., dollars, euros, or thelike) it costs to continue storing the data, whether continued storageof the data object would exceed existing capacity, or the like. In someimplementations, the unit of storage may be scaled proportionally basedon the estimated depreciation in the future cost of storage. This scaledstorage cost provides a user (e.g., an agent, employee, a computersystem (e.g., artificial intelligence agent), or the like from an entityusing the big data storage environment to store the entity's big data)with a more accurate estimated future storage cost.

Though the description of determining a future estimated storage cost isdescribed with respect to a particular data object, the presentdisclosure need not be so limited. For example, the heuristic unit 133may use the future storage cost unit 133 a to determine the futurestorage cost for each data object in a repository of data objects. Insuch instances, the future storage cost for an entire repository of dataobjects may be determined by summing the future storage cost of eachdata object in a data storage repository. In some implementations, theheuristic unit 133 can identify an entire repository of data objects asa set of candidate data objects for storage reclamation if therepository's future storage cost satisfies a predetermined futurestorage cost threshold.

The access window determining unit 133 b is configured to determine aperiod of time when a data object is likely to be accessed. The periodof time when a data object is likely to be accessed may span, forexample, a period of time that extends from the present (or past) timeuntil a future time t. The server 130 can predict, based on the accesswindow for a data object, that it is likely that the data object willnot be accessed after time t.

The access window determining unit 133 b may determine an access windowfor one or more data objects based the audit log data records stored inthe accesses database 132. The access window determining unit 133 b mayaccess 134 the accesses database 132 and using one or more heuristics toestimate access windows of the one or more data objects. In someimplementations, the access window determining unit 133 b may analyzethe aggregated audit log data records to detect trends in data objectaccesses. In some implementations, the access window determining unit133 b may analyze the audit log data records associated with a dataobject to determine a creation date of the data object. Then, the accesswindow determination unit 133 b may predict, based on the data objectcreation date and a future time t for the data object that is apredetermined amount of time in the future after the creation date. Insome implementations, the access window determination unit 133 b may seta future time t for the data object to be, e.g., four months, or more,from the creation of the data object.

Alternatively, or in addition, the access window determining unit 133 bmay consider other factors than data object access history establishedby audit log data records when determining an access window for a dataobject. For example, the access window determining unit 133 b maydetermine an access window based on factors such as compliance with oneor more data retention policy, compliance with one or more legalpolicies, or the like. In such instances, the access window determiningunit 133 b may determine to extend an access window for a data objecteven if the data object has not been accessed, may not be accessed, orthe like in an effort to comply with the established policy.

Access windows may generally be determined for each data object.However, in some instances, if every data object in a data objectrepository is associated with a particular access window expirationdate, then the latest access window expiration date associated with adata object in the data object repository may be used as an accesswindow expiration date for the entire data object repository. Theexpiration date may include one or more of a particular day, aparticular time, a particular day and time, or the like.

The access window determining unit 133 b may determine a confidencescore for each access window. The confidence score may be indicative ofthe likelihood that the data object associated with an access windowwill be accessed after the expiration date such as the end of the accesswindow at time t. In some implementations, the confidence score may bebased on access trends identified during the analysis of the audit logdata records. Alternatively, or in addition, the confidence score may bebased on the amount of time that exists between the current time andtime t. The closer the current time is to time t, the higher theconfidence score may be. Alternatively, or in addition, the confidencescore may be based on whether or not a user (e.g., an agent, anemployee, a computer system (e.g., artificial intelligence agent), orthe like from an entity using the big data storage environment to storethe entity's big data) has previously provided feedback indicating thatthe server 130 should not reclaim storage space associated with the dataobject. For example, a confidence score that a data object will accessedoutside of a determined access window should be lower if the user haspreviously expressed a need for the data object even after expirationdate associated with a particular access window. Such user feedback isindicative of a potential need by the user to keep the data objectstored beyond the determined access window, a flaw in the heuristicsused to determine the access window for the particular data object forwhich the user has provided feedback, or both.

The heuristic unit 133 may provide 135 data (i) identifying a set of oneor more candidate data objects having a predicted future storage costthat satisfies a predetermined future storage cost threshold, (ii) apredicted future storage cost for each data object in the set of one ormore candidate objects, (iii) an access window for each data object inthe set of one or more candidate data objects, and (iv) a confidencescore indicating the likelihood that each data object in the set of dataobjects will not be accessed once the predetermined access windowexpires. The storage reclamation unit 136 may sort the set of one ormore candidate data objects based on the predicted future storage costassociated with each data object, the confidence score associated witheach object, or both. In the example of FIG. 1, the heuristic unit 133may have identified the customer survey repository 160, the social mediapost repository 164, and two columns of a column database 163 as beingcandidate data objects for having their storage space reclaimed.

The storage reclamation unit may then transmit 124 a notification to auser device 110 via a network 115 that is designed to prompt a user ofthe user device 110 to indicate whether or not storage space used tostore one or more of the candidate data objects can be reclaimed. Theuser of the user device 110 may be an agent, employee, computer system(e.g., an artificial intelligence agent), or the like from an entityusing the big data storage environment to store the entity's big data.In some implementations, the storage reclamation unit may transmit 124 anotification to prompt the user to indicate whether or not storage spaceused to store one or more of the candidate data objects can be reclaimedfor each candidate data object. Alternatively, the storage reclamationunit may only transmit 124 notifications to prompt the user to indicatewhether or not storage space used to store one or more candidate dataobjects can be reclaimed if the confidence score associated with thedata object fails to satisfy a predetermined threshold. For thosescenarios where the confidence score satisfies a predetermined threshold(e.g., based on prior feedback from the user), the storage reclamationunit may continue on with the storage reclamation process as if the userprovided feedback indicating that the storage space for the candidatedata object can be reclaimed at the expiration of the data object'saccess window.

The user device 110 receives 125 the notification and generates agraphical user interface 111 for display in the user interface of theuser device 110 that prompts the user of the user device for feedbackregarding potential storage space reclamation of storage space allocatedfor a set of one or more candidate data objects. In particular, the userinterface may ask the user whether it is ok to reclaim the storage spaceallocated to one or more of the identified candidate data objects oncethe determined access window for the data object expires.

The user interface 111 may provide the user with the opportunity toprovide input that is indicative of whether the user consents to thereclamation of storage for each candidate data object identified in thenotification. In the example of FIG. 1, the notification may indicatethat one or more candidate data objects including the customer surveysrepository 112, the social media post repository 113, and two DatabaseColumns 114 of a column database are candidates for having their storagespace reclaimed. The user interface 111 may provide data associated witheach of the one or more candidate data objects for display such as adata object identifier, a predicted future storage cost, and aconfidence score that indicates the likelihood that the data object willbe accessed after the access window for the candidate data objectexpires. In some implementations, the user interface 111 may alsoprovide data indicating the access window time period that is associatedwith each candidate data object.

The user interface 111 may allow the user to indicate whether the userapproves of reclaiming the storage space associated with each respectivedata object. For example, the user can toggle a set of checkboxes 112 a,113 a, 114 a to indicate which of the one or more candidate data objects112, 113, 114 the user thinks should have its storage space reclaimedand which of the one or more candidate data objects should not havetheir storage reclaimed. In the example of FIG. 1, the user may use thecheckboxes 112 a, 113 a, 114 a to indicate that the storage space forthe one or more candidate data objects 112 and 114 should be reclaimedand that the storage space for the candidate data objects 114 should nothave its storage space reclaimed. In some implementations, the user mayselect the “submit” icon 115 to transmit 126 the user's selection asuser feedback to the server 130 via the network 115. Alternatively, theuser may discard the user's selections by selecting the “cancel” icon116.

The server 130 receives 127 the user feedback from the user device 110.The server 130 may provide 138 the user's feedback to the storagereclamation unit 136. The storage reclamation unit 136 processes theuser's feedback and determines whether the storage space for each of theone or more candidate data objects can be reclaimed.

For those candidate data objects such as the social media postrepository 164 that the user indicated should not have their storagespace reclaimed, the storage reclamation unit 136 decides tode-prioritize the data object for storage reclamation consideration.De-prioritizing the data object for storage reclamation may includelabeling the data object with data indicating that the data object canbe bypassed by the heuristic unit 133 for consideration as a candidatedata object for storage space reclamation. In some implementations, thelabel may include data indicating that the data object should only bebypassed for a predetermined amount of time. Alternatively, in otherimplementations, the label may include data indicating that the dataobject should be permanently bypassed by the heuristic unit 133 forconsideration as a candidate data object, based on the user's feedback.

The server 130 also provides 140 the user feedback to the heuristic unit133. The heuristic unit 133 may process the user feedback and use theuser feedback indicating a user's decision to not reclaim storage spaceallocated to a particular data object as a factor in determining futurestorage costs for data objects. Alternatively, or in addition, the userfeedback indicating a user's decision to not reclaim storage space maysubsequently be used as a factor in determining an access window for oneor more data object in the future.

On the other hand, for those candidate data objects such as the customersurveys repository 160 and the one or more database columns of columndatabase 160 that the user indicated should have their storage spacereclaimed upon expiration of each respective data object's accesswindow, the storage reclamation unit 136 can generate and output 139 aninstruction that instructs the big data storage environment 145 toreclaim data storage allocated to the customer survey repository 160 andtwo database columns of the column database repository 163 upon theexpiration of the each respective data object's access window.

The server 130 may transmit 128 the instruction generated by the storagereclamation unit 136 to the big data storage environment 145 via thenetwork 115. The big data storage environment 145 may receive 129 andprocess the instruction from the server 130. In response to theinstruction received 129 from the server 130, the big data storageenvironment 145 labels each data object identified by the receivedinstruction with an expiration label that includes the expiration time tof the access window that is associated with each respective dataobject. The big data storage environment 145 may monitor the expirationlabels of data objects stored by the big data storage environment 145.Then, the big data storage environment 145 can reclaim the storage spaceallocated to the labeled data objects at the future time indicated by alabeled data object's expiration label.

By way of example, the big data storage environment 145 can label thecustomer survey repository 160 and two of the columns of the columndatabase 163 with respective labels based on the instruction receivedfrom the server 130. Then, upon detection of the respective timesindicated by the expiration label associated with the customer surveyrepository's and the expiration label associated with two of the columnsof the column database 163, the big data storage environment may deletethe customer survey repository 160 and the two columns of the columndatabase 163. Note that the expiration time t for each respective dataobject was previously determined by the access window determination unitand can include different times or the same time for each data object.

In FIG. 1, the storage space 147-m is shown at stage B, which occurs atsome point in time after the time indicated by each of the respectivelabels associated with the customer survey repository 160 and two of thecolumns of the column database 163 has expired. The storage space 147-mshows that the customer service repository and two of the columns of thecolumn database have been reclaimed by deleting the customer servicerepository and two of the columns of the column database. The reclaimedstorage space associated with each of the customer service repositoryand two of the columns of the column database is shown as 164B and 163B,respectively.

FIG. 2 is a flowchart of a process 200 for reclaiming storage space in astorage environment. For convenience, the process 200 will be describedas being performed by a system of one or more computers located in oneor more locations. For example, a system such as the system 100 can beappropriately programed in accordance with this specification to performthe process 200. Though the process 200 may be performed on any storageenvironment, for purposes of the description of FIG. 2, the storageenvironment is referred to as a big data storage environment.

The process 200 begins with the system aggregating 210 data that isindicative of access to one or more data objects stored in a big datastorage environment. Aggregating data that is descriptive of access todata objects stored in the big data storage environment may include, forexample, the system obtaining data records stored by one or more auditlogs associated with each data object stored in the big data storageenvironment. The system may obtain data records stored by the audit logby transmitting a request for audit log data records to each audit logmaintained by the big data storage environment. In response to therequest, the system may receive one or more audit log data recordsmaintained by each respective audit log. The system may receive theaudit log data records and store the received audit log data records inan accesses database. Each respective audit log may include data thatindicates a data object that was accessed, the type of access, and atime stamp indicating when the access took place. The aggregated datarecords from each of the audit logs can be used by the system todetermine an access window for one or more data objects stored by thebig data storage environment.

The system may transmit multiple requests for audit log data recordsover time in an effort to keep the accesses database up to date. Forexample, the system may be configured to periodically request datarecords from audit logs at predetermined intervals (e.g., hourly, daily,nightly, weekly, or the like.). Alternatively, or in addition, thesystem may be configured to request data records from audit logs ondemand (e.g., in response to a user instruction). Alternatively, or inaddition, the system may be configured to obtain the data records fromaudit logs associated with one or more data objects prior to making arecommendation to a user of a user device that the storage spaceallocated to one or more data objects may be suitable for reclamation.

The system determines 220 a future storage cost associated with eachdata object of a plurality of data objects in the big data storageenvironment. The system may determine a future storage cost for one ormore data objects in the big data storage environment using one or moreheuristics that consider a variety of factors such as the footprint ofthe data object, replication of the data object, retention of datasetscontaining the data objects, overall depreciation of storage price,feedback from entities responsible for oversight of the data object.Entities responsible for oversight of the data object may include, forexample, an agent, an employee, or the like from an entity using the bigdata storage environment to store the entity's big data, a combinationthereof, or the like.

In some implementations, predicting a future storage cost for one ormore data objects may include the system accessing and analyzing theaudit log data records aggregated at stage 210 and stored in theaccesses database. The system may predict a future storage cost for arespective data object based on trends detected in the historicalaccesses logged for the data object. By way of example, a higher futurestorage cost may be predicted for a data object if, for example, theaggregated audit logs indicate that the footprint for the data object isincreasing, if the data object is routinely replicated, if data setscontaining the data object are retained for indefinite periods of time,a combination thereof, or the like.

In some implementations, the system may predict a future storage cost byusing heuristics that consider factors other than just the amount ofstorage space that a data object requires. For example, the system maypredict the future storage cost for a data object based on (i) theamount of storage space that a data object is predicted to require and(ii) an estimated depreciation in the price of storage space.Determining a predicted future storage cost for a data object as afunction of both (i) an amount of future storage space required for thedata object and (ii) the depreciation in price of storage space providesa more accurate storage cost estimate in a big data storage environment145 where storage is vast and additional storage can be readily added.

The system determines 230 an access window for each of the plurality ofdata objects in the big data storage environment. The access window mayinclude a period of time when a data object is likely to be accessed. Adetermined access window may span, for example, a period of time thatextends from the present (or past) time until a future time t. Thefuture time t may be referred to as an expiration date of the accesswindow. The expiration date may include one or more of a particular day,a particular time, a particular day and time, or the like. The systemmay determine an access window by accessing the accesses database andusing one or more heuristics to estimate an access window of one or moredata objects based on the audit log data records aggregated and storedin the accesses database.

In some implementations, the system may analyze the aggregated audit logdata records for each data object stored in the big data storageenvironment to detect trends in data object accesses. For example, thesystem may analyze the audit log data records associated with a dataobject to determine a creation date of the data object. The creationdate may be determined by detecting the audit data log data recordrepresentative of the first write operation associated with the dataobject. Then, the system may predict, based on the data object creationdate specified by one or more audit log data records in the accessdatabase, a future time t for the data object that is a predeterminedamount of time in the future after the creation date of the data object.In one implementation, the system may set a future time t for the dataobject to be four months, or more, from the creation of data the object.

The system may generally determine an access window for each data objectin the big data storage environment. However, in some instance, theaccess window of individual data objects may be used to determine anaccess window for an entire repository of data objects. For example, ifevery data object in a data object repository is associated with aparticular access window expiration time, then at any particular pointin time, the latest access window expiration time may be used as anaccess window expiration time for the entire data object repository.

The system identifies 240 one or more first data objects that arecandidates for having their storage reclaimed based on a future storagecost. In some implementations, the system may also identify the one ormore first data objects based on an access window. For example,identifying the first data object may include identifying one or moredata objects that (i) are associated with a future storage cost thatsatisfies a predetermined future storage cost threshold, and (ii) arenot likely to be accessed outside of the access window for the dataobject. The predetermined future storage cost threshold may be set to acost threshold that balances estimated benefits of reclaiming thestorage space associated with the one or more first data objects and thecomputational resource cost (e.g., CPU usage, memory usage, bandwidthconsumption, system downtime to perform reclamation, or the like) thatmust be expended to reclaim the storage space. In such instances, if adetermined future storage cost for a data object satisfies apredetermined future storage cost threshold, then the benefit ofreclaiming storage space associated with the data object is greater thanthe cost of computational resources that are expended to reclaim thestorage space associated with the data object. In such a scenario, thesystem may reclaim the storage space associated with the data object.Similarly, if a determined future storage cost for a data object doesnot satisfy a predetermined future storage cost threshold, then thebenefit of reclaiming storage space associated with the data object isless than the computational resources that are expended to reclaim thestorage space associated with the data object. In such instances, thesystem may not reclaim the storage space associated with the dataobject.

The system may sort the one or more first data objects based on thepotential future storage cost that can be reclaimed if the one or morefirst data objects are deleted, a confidence score associated with theaccess window, or both. The confidence score associated with the accesswindow may be indicative of the likelihood that the data objectassociated with an access window will be accessed after the expirationof the end of the access window at time t.

The system provides a notification that includes a prompt 250 to a userdevice that asks whether one or more of the first data objects can bedeleted after expiration of the access window for the respective dataobject. In some implementations, the system only generates anotification to the user for a subset of the first data objects. Thesubset of the first data objects may include the set of data objectsthat are most likely to be approved for storage reclamation. Dataobjects that are most likely to be reclaimed may include those dataobjects with the largest potential cost savings. The user of the userdevice may be an agent, employee, computer system (e.g., artificialintelligence agent), or the like from an entity using the big datastorage environment to store the entity's big data. The notification maybe provided for display in the user interface of the user device.

The displayed notification may provide the user with the opportunity toprovide input that is indicative of whether the user consents to thereclamation of storage for each candidate data object identified in thenotification. The user interface may provide data associated with eachof the one or more candidate data objects for display such as a dataobject identifier, a predicted future storage cost, and a confidencescore that indicates the likelihood that the data object will beaccessed after the access window for the candidate data object expires,or the like. In some implementations, the user interface may alsoprovide data indicating the access window time period that is associatedwith each candidate data object.

The user interface allows the user to input data that indicates whetherthe user approves of reclaiming the storage space associated with eachrespective data object associated with the notification. For example,the user can toggle a set of checkboxes to indicate which of the one ormore candidate data objects the user thinks should have its storagereclaimed at the expiration of each candidate data object's accesswindow and which of the one or more candidate data objects should nothave their storage reclaimed at the expiration of each candidate dataobject's access window. In some implementations, the user may select a“submit” icon to transmit the user's selection(s) as user feedback tothe server via the network. Alternatively, the user may discard theuser's selection(s) by selecting the “cancel” icon.

The system receives the user's feedback and determines 260, for eachdata object of the first data objects identified in the prompt to theuser, whether a response received from the user indicates that the dataobject can be deleted after expiration of the access window associatedwith the data object. In response to determining at stage 260 that theuser indicated that the data object can be deleted at the expiration ofthe data object's access window, the system generates 270 an instructionthat instructs the big data storage environment to label the data objectfor deletion upon the expiration of the access window. Alternatively, inresponse to determining at stage 260 that the user indicated that thedata object cannot be deleted at the expiration of the data object'saccess window, the system adjusts one or more heuristics used todetermine the storage cost, access window, or both.

A data object may be described generally as a unit of stored data whosestorage space can be reclaimed. In the context of a big data storageenvironment, a data object may include structured data such as one ormore columns in a database that may comprise multiple columns (e.g.,hundreds of columns, thousands of columns, millions of columns, or evenmore). By way of another example, a data object may include, forexample, a storage bucket in a key-value based storage system.Alternatively, or in addition, a big data storage environment may alsoinclude data objects that include unstructured data items. Examples ofunstructured data objects may include, for example, one or more socialmedia posts, one or more customer surveys, one or more documents, or thelike.

A repository may be generally described as a group of multiple dataobjects of a similar type. For example, a repository in a big datastorage environment may include structured data such as a database ofmultiple columns (e.g., hundreds of columns, thousands of columns,millions of columns, or even more). Alternatively, or in addition, a bigdata storage environment may also include repositories of unstructureddata items. For example, a repository of unstructured data items mayinclude a storage space storing an entire collection of social mediaposts, a storage space storing an entire collection of customer surveys,a storage space storing a collection of documents, or the like.

“Big data” is understood to describe data sets that are so large andcomplex that traditional data processing application software isinadequate to store, organize, search, and analyze the data sets.Generally, “big data” may currently have a scale that measures in therealm of hundreds of terabytes, multiple petabytes, multiple exabytes,or more and include structured data, unstructured data, or both.However, as time progresses, “big data” systems may be capable ofstoring data on even greater scales. A “big data” storage environmentmay include, one or more server computers that provides physical storageand software tools necessary to store, maintain, search, retrieve, andanalyze “big data.” Moreover, such a “big data” storage environmentincludes software tools for performing the aforementioned operations inorder to infer conclusions from “big data.” Alternatively, or inaddition, “big data” may be characterized based on attributes such asvolume, velocity, variety, and veracity.

The volume attribute refers to the amount of data that a storageenvironment maintains. A storage environment is more likely to be a “bigdata” storage environment if, for example, the storage environmentmaintains large volumes of data on the order of several terabytes,petabytes, exabytes, or more.

The velocity attribute refers to the rate at which new data items arebeing generated. A storage environment is more likely to be a “big data”storage environment if, for example, a large amount of new data itemsare being generated and stored. Some “big data” storage environmentsmay, for example, generate or receive new data for every stock trade,every social media post, every sales transaction, every customer surveycompleted, every change in inventory data, every email messagetransmitted or received, or the like.

The variety attribute refers to the number of different types of sourcesthat generate diverse types of data stored in the storage environment. Astorage environment is more likely to be a “big data” storageenvironment if, for example, a diverse set of devices is generating thedata that is maintained by the storage environment. For example, a “bigdata” storage environment may maintain data that is generated by one ormore server computers, desktop computers, laptop computers, smartphones, tablets, connected appliances, smart watches, other wearables,rfid tags, other sensors, or the like. Alternatively, or in addition, astorage environment is more likely to be a “big data” storageenvironment if, for example, the storage environment maintains diversetypes of data such as event data detected by event processing systems,financial transaction data, sales data, inventory data, social mediaposts, security camera video or images, health data, device locationinformation, purchase location data, and the like.

The veracity attribute refers to the reliability of the data stored inthe storage environment. A storage environment is more likely to be a“big data” storage environment if, for example, the data that ismaintained by the storage environment includes data that varies in itsreliability. The reliability of “big data” may vary due to the largevolume of unfiltered data that is received and maintained by the “bigdata” storage environment.

Embodiments of the subject matter, the functional operations and theprocesses described in this specification can be implemented in digitalelectronic circuitry, in tangibly-embodied computer software orfirmware, in computer hardware, including the structures disclosed inthis specification and their structural equivalents, or in combinationsof one or more of them. Embodiments of the subject matter described inthis specification can be implemented as one or more computer programs,i.e., one or more modules of computer program instructions encoded on atangible nonvolatile program carrier for execution by, or to control theoperation of, data processing apparatus. Alternatively or in addition,the program instructions can be encoded on an artificially generatedpropagated signal, e.g., a machine-generated electrical, optical, orelectromagnetic signal that is generated to encode information fortransmission to suitable receiver apparatus for execution by a dataprocessing apparatus. The computer storage medium can be amachine-readable storage device, a machine-readable storage substrate, arandom or serial access memory device, or a combination of one or moreof them.

The term “data processing apparatus” encompasses all kinds of apparatus,devices, and machines for processing data, including by way of example aprogrammable processor, a computer, or multiple processors or computers.The apparatus can include special purpose logic circuitry, e.g., an FPGA(field programmable gate array) or an ASIC (application specificintegrated circuit). The apparatus can also include, in addition tohardware, code that creates an execution environment for the computerprogram in question, e.g., code that constitutes processor firmware, aprotocol stack, a database management system, an operating system, or acombination of one or more of them.

A computer program (which may also be referred to or described as aprogram, software, a software application, a module, a software module,a script, or code) can be written in any form of programming language,including compiled or interpreted languages, or declarative orprocedural languages, and it can be deployed in any form, including as astandalone program or as a module, component, subroutine, or other unitsuitable for use in a computing environment. A computer program may, butneed not, correspond to a file in a file system. A program can be storedin a portion of a file that holds other programs or data (e.g., one ormore scripts stored in a markup language document), in a single filededicated to the program in question, or in multiple coordinated files(e.g., files that store one or more modules, sub programs, or portionsof code). A computer program can be deployed to be executed on onecomputer or on multiple computers that are located at one site ordistributed across multiple sites and interconnected by a communicationnetwork.

The processes and logic flows described in this specification can beperformed by one or more programmable computers executing one or morecomputer programs to perform functions by operating on input data andgenerating output. The processes and logic flows can also be performedby, and apparatus can also be implemented as, special purpose logiccircuitry, e.g., an FPGA (field programmable gate array) or an ASIC(application specific integrated circuit).

Computers suitable for the execution of a computer program include, byway of example, can be based on general or special purposemicroprocessors or both, or any other kind of central processing unit.Generally, a central processing unit will receive instructions and datafrom a read-only memory or a random access memory or both. The essentialelements of a computer are a central processing unit for performing orexecuting instructions and one or more memory devices for storinginstructions and data. Generally, a computer will also include, or beoperatively coupled to receive data from or transfer data to, or both,one or more mass storage devices for storing data, e.g., magnetic,magneto optical disks, or optical disks. However, a computer need nothave such devices. Moreover, a computer can be embedded in anotherdevice, e.g., a mobile telephone, a personal digital assistant (PDA), amobile audio or video player, a game console, a Global PositioningSystem (GPS) receiver, or a portable storage device (e.g., a universalserial bus (USB) flash drive), to name just a few.

Computer readable media suitable for storing computer programinstructions and data include all forms of nonvolatile memory, media andmemory devices, including by way of example semiconductor memorydevices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks,e.g., internal hard disks or removable disks; magneto optical disks; andCD-ROM and DVD-ROM disks. The processor and the memory can besupplemented by, or incorporated in, special purpose logic circuitry.

To provide for interaction with a user, embodiments of the subjectmatter described in this specification can be implemented on a computerhaving a display device, e.g., a CRT (cathode ray tube) or LCD (liquidcrystal display) monitor, for displaying information to the user and akeyboard and a pointing device, e.g., a mouse or a trackball, by whichthe user can provide input to the computer. Other kinds of devices canbe used to provide for interaction with a user as well; for example,feedback provided to the user can be any form of sensory feedback, e.g.,visual feedback, auditory feedback, or tactile feedback; and input fromthe user can be received in any form, including acoustic, speech, ortactile input. In addition, a computer can interact with a user bysending documents to and receiving documents from a device that is usedby the user; for example, by sending web pages to a web browser on auser's client device in response to requests received from the webbrowser.

Embodiments of the subject matter described in this specification can beimplemented in a computing system that includes a back end component,e.g., as a data server, or that includes a middleware component, e.g.,an application server, or that includes a front end component, e.g., aclient computer having a graphical user interface or a Web browserthrough which a user can interact with an implementation of the subjectmatter described in this specification, or any combination of one ormore such back end, middleware, or front end components. The componentsof the system can be interconnected by any form or medium of digitaldata communication, e.g., a communication network. Examples ofcommunication networks include a local area network (“LAN”) and a widearea network (“WAN”), e.g., the Internet.

The computing system can include clients and servers. A client andserver are generally remote from each other and typically interactthrough a communication network. The relationship of client and serverarises by virtue of computer programs running on the respectivecomputers and having a client-server relationship to each other.

While this specification contains many specific implementation details,these should not be construed as limitations on the scope of what may beclaimed, but rather as descriptions of features that may be specific toparticular embodiments. Certain features that are described in thisspecification in the context of separate embodiments can also beimplemented in combination in a single embodiment. Conversely, variousfeatures that are described in the context of a single embodiment canalso be implemented in multiple embodiments separately or in anysuitable subcombination. Moreover, although features may be describedabove as acting in certain combinations and even initially claimed assuch, one or more features from a claimed combination can in some casesbe excised from the combination, and the claimed combination may bedirected to a subcombination or variation of a subcombination.

Similarly, while operations are depicted in the drawings in a particularorder, this should not be understood as requiring that such operationsbe performed in the particular order shown or in sequential order, orthat all illustrated operations be performed, to achieve desirableresults. In certain circumstances, multitasking and parallel processingmay be advantageous. Moreover, the separation of various systemcomponents in the embodiments described above should not be understoodas requiring such separation in all embodiments, and it should beunderstood that the described program components and systems cangenerally be integrated together in a single software product orpackaged into multiple software products.

Particular embodiments of the subject matter have been described. Otherembodiments are within the scope of the following claims. For example,the actions recited in the claims can be performed in a different orderand still achieve desirable results. As one example, the processesdepicted in the accompanying figures do not necessarily require theparticular order shown, or sequential order, to achieve desirableresults. In certain implementations, multitasking and parallelprocessing may be advantageous. Other steps may be provided, or stepsmay be eliminated, from the described processes. Accordingly, otherimplementations are within the scope of the following claims.

What is claimed is:
 1. A method comprising: determining, by one or more server computers, a future storage cost associated with a given data object of a plurality of storage objects in a storage environment, the future storage cost based on: historical usage of the given data object based on one or more audit logs associated with the given data object, each audit log including, for each access to the given data object, a timestamp indicating an occurrence of the access to the given data object; and an access window of the given data object as a period of time when the given data object is likely to be accessed based on the audit logs, the access window having a respective expiration date in the future; determining, by the one or more server computers, whether the future storage cost associated with the given data object satisfies a threshold storage cost; and when the future storage cost associated with the given data object satisfies the threshold storage cost: providing, by the one or more server computers and to a computer system hosting a computing agent, a notification prompting the computing agent to determine whether the given data object can be deleted after the respective expiration date of the access window of the given data object; receiving, by the one or more server computers, a response, from the computer system hosting the computing agent, indicative of whether the given data object can be deleted after the respective expiration date of the access window of the given data object; when the response indicates that the given data object can be deleted after the respective expiration date of the access window of the given data object, generating an instruction to cause deletion of the given data object after the respective expiration date of the access window of the given data object; and when the response indicates that the given data object cannot be deleted after the respective expiration date of the access window of the given data object, adjusting the access window of the given data object.
 2. The method of claim 1, wherein the computing agent comprises an artificial intelligence agent.
 3. The method of claim 1, further comprising: determining, by the computer system that hosts the computing agent, a confidence score for the given data object, the confidence score indicating a likelihood that the given data object will be accessed after the respective expiration date of the access window of the given data object.
 4. The method of claim 3, wherein the future storage cost associated with the given data object is based on the confidence score for the given data object.
 5. The method of claim 3, wherein the computing agent hosted by the computer system determines whether the given data object can be deleted after the respective expiration date of the access window of the given data object based on the confidence score.
 6. The method of claim 1, wherein determining the future storage cost associated with the given data object of the plurality of data storage objects in the storage environment comprises using one or more heuristics to estimate a potential future storage cost of the given data object based on a predicted future depreciation of storage prices.
 7. The method of claim 1, wherein the notification causes the computing agent to prompt a user of the computer system hosting the computing agent for feedback regarding potential storage space reclamation of storage space allocated for a set of one or more candidate data objects including the given data object.
 8. A system comprising: data processing hardware; and memory hardware in communication with the data processing hardware, the memory hardware storing instructions that when executed on the data processing hardware cause the data processing hardware to perform operations comprising: determining, by one or more server computers, a future storage cost associated with a given data object of a plurality of storage objects in a storage environment, the future storage cost based on: historical usage of the given data object based on one or more audit logs associated with the given data object, each audit log including, for each access to the given data object, a timestamp indicating an occurrence of the access to the given data object; and an access window of the given data object as a period of time when the given data object is likely to be accessed based on the audit logs, the access window having a respective expiration date in the future; determining, by the one or more server computers, whether the future storage cost associated with the given data object satisfies a threshold storage cost; and when the future storage cost associated with the given data object satisfies the threshold storage cost: providing, by the one or more server computers and to a computer system hosting a computing agent, a notification prompting the computing agent to determine whether the given data object can be deleted after the respective expiration date of the access window of the given data object; receiving, by the one or more server computers, a response, from the computer system hosting the computing agent, indicative of whether the given data object can be deleted after the respective expiration date of the access window of the given data object; when the response indicates that the given data object can be deleted after the respective expiration date of the access window of the given data object, generating an instruction to cause deletion of the given data object after the respective expiration date of the access window of the given data object; and when the response indicates that the given data object cannot be deleted after the respective expiration date of the access window of the given data object, adjusting the access window of the given data object.
 9. The system of claim 8, wherein the computing agent comprises an artificial intelligence agent.
 10. The system of claim 8, further comprising: determining, by the computer system that hosts the computing agent, a confidence score for the given data object, the confidence score indicating a likelihood that the given data object will be accessed after the respective expiration date of the access window of the given data object.
 11. The system of claim 10, wherein the future storage cost associated with the given data object is based on the confidence score for the given data object.
 12. The system of claim 10, wherein the computing agent hosted by the computer system determines whether the given data object can be deleted after the respective expiration date of the access window of the given data object based on the confidence score.
 13. The system of claim 8, wherein determining the future storage cost associated with the given data object of the plurality of data storage objects in the storage environment comprises using one or more heuristics to estimate a potential future storage cost of the given data object based on a predicted future depreciation of storage prices.
 14. The system of claim 8, wherein the notification causes the computing agent to prompt a user of the computer system hosting the computing agent for feedback regarding potential storage space reclamation of storage space allocated for a set of one or more candidate data objects including the given data object.
 15. A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising: determining, by one or more server computers, a future storage cost associated with a given data object of a plurality of storage objects in a storage environment, the future storage cost based on: historical usage of the given data object based on one or more audit logs associated with the given data object, each audit log including, for each access to the given data object, a timestamp indicating an occurrence of the access to the given data object; and an access window of the given data object as a period of time when the given data object is likely to be accessed based on the audit logs, the access window having a respective expiration date in the future; determining, by the one or more server computers, whether the future storage cost associated with the given data object satisfies a threshold storage cost; and when the future storage cost associated with the given data object satisfies the threshold storage cost: providing, by the one or more server computers and to a computer system hosting a computing agent, a notification prompting the computing agent to determine whether the given data object can be deleted after the respective expiration date of the access window of the given data object; receiving, by the one or more server computers, a response, from the computer system hosting the computing agent, indicative of whether the given data object can be deleted after the respective expiration date of the access window of the given data object; when the response indicates that the given data object can be deleted after the respective expiration date of the access window of the given data object, generating an instruction to cause deletion of the given data object after the respective expiration date of the access window of the given data object; and when the response indicates that the given data object cannot be deleted after the respective expiration date of the access window of the given data object, adjusting the access window of the given data object. 